A Parallel Simulated Annealing on Distributed Computing Resources
نویسندگان
چکیده
In this paper, we present a parallel simulated annealing (SA) on distributed computing resources. The parallel SA include two types of cooperation mechanism: inner group and inter group cooperations. In the inner group cooperation, SA processes start from the same initial point, however, move to different direction. That is, two concepts: concentration and diversity are included. On the other hand, the inter group cooperation is for load balancing which is performed based on search load factor. Therefore it is useful to balance searching load by reassigning dynamically processors from light load groups to heavy load groups. Computer experiment evaluates effectiveness of the proposed parallel SA.
منابع مشابه
Distributed Simulated Annealing with MapReduce
Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used ...
متن کاملParallel Simulated Annealing on a Flexible Multi-DSP System
This paper presents parallel simulated annealing techniques realized on a multiDSP system with distributed memory and a point-to-point communication structure. Four parallelization techniques are assessed. The main aspects of our research are solution quality, computation time, speedup and scalability. Finally, experimental results for typical NP-hard problems with di erent complexity are compa...
متن کاملCombinatorial Double Auction Winner Determination in Cloud Computing using Hybrid Genetic and Simulated Annealing Algorithm
With the advancement of information technology need to perform computing tasks everywhere and all the time there, in cloud computing environments and heterogeneous users have access to different sources with different characteristics that these resources are geographically in different areas. Due to this, the allocation of resources in cloud computing comes to the main issue is considered a maj...
متن کاملProblem Independent Distributed Simulated Annealing and its Applications
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known. In this paper, we present a problem independent general purpose parallel implementa...
متن کاملSimulated Annealing and its Applications
Simulated annealing has proven to be a good technique for solving hard combina-torial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known. In this paper, we present a problem independent general purpose parallel implement...
متن کامل